The Modified Schultz Index of Trees
نویسندگان
چکیده
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊂V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Lower bounds on modified Schultz index in trees in terms of the order and diameter are determined. Mathematics Subject Classification: 05C05, 05C12
منابع مشابه
On the distance based indices of H-phenylenic nanotorus
Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...
متن کاملGeneralized Wiener Indices in Hexagonal Chains
The Wiener Index, or the Wiener Number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener Index for trees, and Ivan Gutman proposed a modification of the Schultz index with...
متن کاملExtremal Modified Schultz Index of Bicyclic Graphs
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊆V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the modified Schultz index of B(n), graphs in B(n) with the smallest modified Schultz index S∗(G) a...
متن کاملSpecies Diversity of Trees and Forest Floor Plants in Oriental beech Forest Types of Shastkalate Educational and Research Forest, Gorgan)
Trees are the most important biological elements of forest ecosystems. The variability of the tree species composition inhabiting in the Oriental beech forest, not only forms different forest types but also has a remarkable impact on the species diversity of forest floor plants, due to the existence of trees in the overstory layer. In this research, forest types of an an Oriental beech were ide...
متن کاملThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کامل